Elongation of curvature-bounded path

نویسندگان

چکیده

The elongation of curvature-bounded paths to an expected length is fundamentally important plan missions for nonholonomic-constrained vehicles in many practical applications, such as coordinating multiple reach a destination simultaneously or performing mission with strict time window. In the paper, by applying properties reachability set paths, explicit conditions existence joining two oriented points are established. These numerically verifiable, allowing readily checking between prescribed desired length. addition, once met, strategies provided get Finally, some examples minimum-time path planning Dubins cooperatively achieve triangle-shaped formation presented, illustrating and verifying developments paper.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Bounded-Curvature Path Normalization

We present a new normal form for bounded-curvature paths that admits a combinatorial discription of such paths and a bound on the algebraic complexity of the underlying geometry.

متن کامل

Curvature Continuous and Bounded Path Planning for Fixed-Wing UAVs

Unmanned Aerial Vehicles (UAVs) play an important role in applications such as data collection and target reconnaissance. An accurate and optimal path can effectively increase the mission success rate in the case of small UAVs. Although path planning for UAVs is similar to that for traditional mobile robots, the special kinematic characteristics of UAVs (such as their minimum turning radius) ha...

متن کامل

Convex tours of bounded curvature

We consider the motion planning problem for a point constrained to move along a smooth closed convex path of bounded curvature. The workspace of the moving point is bounded by a convex polygon with m vertices, containing an obstacle in a form of a simple polygon with n vertices. We present an O(m + n) time algorithm finding the path, going around the obstacle, whose curvature is the smallest po...

متن کامل

Convex Hulls of Bounded Curvature

In this paper, we consider the problem of computing a convex hull of bounded curvature of a set S of points in the plane, i.e. a set containing S and whose boundary is a curve of bounded curvature of minimal length. We prove that, if the radius of the smallest disk that contains S is greater than 1, such a hull is unique. We show that the computation of a convex hull of bounded curvature reduce...

متن کامل

The Cost of Bounded Curvature

We study the motion-planning problem for a car-like robot whose turning radius is bounded from below by one and which is allowed to move in the forward direction only (Dubins car). For two robot configurations σ, σ′, let `(σ, σ′) be the shortest bounded-curvature path from σ to σ′. For d > 0, let `(d) be the supremum of `(σ, σ′), over all pairs (σ, σ′) that are at Euclidean distance d. We study...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Automatica

سال: 2023

ISSN: ['1873-2836', '0005-1098']

DOI: https://doi.org/10.1016/j.automatica.2023.110936